Finding a feasible course schedule using Tabu search
نویسندگان
چکیده
منابع مشابه
Finding a feasible course schedule using Tabu search
Hertz, A., Finding a feasible course schedule using Tabu search, Discrete Applied Mathematics 35 (1992) 255-270. We consider a course scheduling problem in which the total number of time periods assigned to each topic has to be split into daily amounts of consecutive time periods called daily quantums. These daily quantums may be arbitrary but are bounded by given minimal and maximal values. In...
متن کاملA Tabu Search Algorithm to Schedule University Examinations?
A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly spacing the exams in the examination period. The algorithm has been imbedded into a package to be used by Faculty administrators and proposes solutions to be considered by the parties involved: administration, departments and students. Computa...
متن کاملFinding Line Segments with Tabu Search
The problem of detecting straight lines arises frequently in image processing and computer vision. Here we consider the problem of extracting lines from range images and more generally from sets of three-dimensional (3D) points. The problem is stated as follows. Given a set Γ of points in 3D space and a non-negative constant , determine the line that is at a distance at most from the maximal nu...
متن کاملFinding multi-constrained feasible paths by using depth-first search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in Quality-of-Service (QoS) routing, which is NPComplete when the number of independent routing constraints is more than one. EDFS solves the general kconstrained MCP problem with pseudo-polynomial time complexity O(m2 · E N + N 2), where m is the maximum number of non-dominated paths m...
متن کاملAdaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general framework composed of three phases: initialization, intensification and diversification. The initialization phase constructs a feasible initial timetable using a fast greedy heuristic. Then an adaptively combined intensific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90248-9